翻訳と辞書 Words near each other ・ Skip Carnine ・ Skip counting ・ Skip Cutting ・ Skip Daly ・ Skip Day (The Cleveland Show) ・ Skip distance ・ Skip Drinkwater ・ Skip E. Lowe ・ Skip Engblom ・ Skip Ewing ・ Skip field ・ Skip Frye ・ Skip Garibaldi ・ Skip Gilbert ・ Skip Gougler ・ Skip graph ・ Skip Guinn ・ Skip Hahn ・ Skip Hall ・ Skip Hall (MMA) ・ Skip Harlicka ・ Skip Heitzig ・ Skip Heller ・ Skip Henderson ・ Skip Hicks ・ Skip Hinnant ・ Skip hoist ・ Skip Hollandsworth ・ Skip Holm ・ Skip Holtz Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Skip graph ： ウィキペディア英語版 Skip graph Skip graphs are a kind of distributed data structure based on skip lists. They were invented in 2003 by James Aspnes and Gauri Shah. They have the full functionality of a balanced tree in a distributed system. Skip graphs are mostly used in searching peer-to-peer networks. As they provide the ability to query by key ordering, they improve other search tools based on the hash table functionality only. In contrast to skip lists and other tree data structures, they are very resilient and can tolerate a large fraction of node failures. Also, constructing, inserting, searching and repairing a skip graph that was disturbed by failing nodes can be done by straightforward algorithms. ==Description== A skip graph is a distributed data structure based on skip lists designed to resemble a balanced search tree. They are one of several methods to implement a distributed hash table, which are used to locate resources stored in different locations across a network, given the name (or key) of the resource. Skip graphs offer several benefits over other distributed hash table schemes such as Chord (peer-to-peer) and Tapestry (DHT), including addition and deletion in expected logarithmic time, logarithmic space per resource to store indexing information, no required knowledge of the number of nodes in a set and support for complex range queries. A major distinction from Chord and Tapestry is that there is no hashing of search keys of resources, which allows related resources to be near each other in the skip graph; this property makes searches for values within a given range feasible. Another strength of skip graphs is the resilience to node failure in both random and adversarial failure models. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Skip graph」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.